Convex Sets and Nearest Points

Convex Sets and Nearest Points. Ip

Convex Sets and Nearest Points1

POINTS FOR m-CONVEX SETS

Let S be closed, m-convex subset of R d S locally a full ddimensional, with Q the corresponding set of Inc points of S If q is an essential inc point of order k then for some neighborhood U of q Q u is expressible as a union of k or fewer (d2)-dimenslonal manifolds, each containing q For S compact, if to every q E Q there corresponds a k > 0 such that q is an essential inc point of order k then...

Exterior point algorithms for nearest points and convex quadratic programs

We consider the problem of finding the nearest point (by Euclidean distance) in a simplicial cone to a given point, and develop an exterior penalty algorithm for it. Each iteration in the algorithm consists of a single Newton step following a reduction in the value of the penalty parameter. Proofs of convergence of the algorithm are given. Various other versions of exterior penalty algorithms f...

Nearest Points and Delta Convex Functions in Banach Spaces

Given a closed set C in a Banach space (X, ‖ · ‖), a point x ∈ X is said to have a nearest point in C if there exists z ∈ C such that dC(x) = ‖x − z‖, where dC is the distance of x from C. We shortly survey the problem of studying the size of the set of points in X which have nearest points in C. We then turn to the topic of delta-convex functions and indicate how it is related to finding neare...